// Copyright 2024 The Google Research Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#ifndef CUBE_UNFOLDINGS_UNFOLDINGS_H_
#define CUBE_UNFOLDINGS_UNFOLDINGS_H_
#include <cstdlib>

namespace cube_unfoldings {
// Counts the number of unique perfect matchings (under automorphism) in the
// given tree. The tree is assumed to be in a format recognized by nauty
// (sparse6, graph6).
size_t NumberOfUniqueMatchings(const char* tree);
}  // namespace cube_unfoldings

#endif  // CUBE_UNFOLDINGS_UNFOLDINGS_H_
